A Fast Algorithm for Delaunay Based Surface Reconstruction

Advanced 3D scanning technologies enable us to obtain dense and accurate surface sample point sets. From sufficiently dense sample point set, Crust algorithm, which is based on Voronoi diagram and its dual Delaunay triangulation, can reconstruct a triangle mesh that is topologically valid and convergent to the original surface. However, the algorithm is restricted in the practical application because of its long running time. Based on the fact that we do not need dense sample in featureless area for successful reconstruction, we propose a nonuniformly sampling method to resample the input data set according to the local feature size before reconstruction. In this way, we increase the speed of reconstruction without losing the details we need.